搜索资源列表
运用递归来解N皇后问题
- 运用递归来解N皇后问题-use recursive solution to the problem of N Queen
NQueens
- 这是一个八皇后问题的扩展，使用java实现，扩展到了多皇后，只要你输入皇后的个数，能给出所有的解。-This is an expansion of 8 Queen
NQueen
- 本实例通过堆栈以及回朔法进行N皇后的遍历.-This instance through the stack as well as the retrospective method of traversal N Queen.
javaalgorithm
- 包括冒泡排序，归并排序，N皇后，最小生成树等经典算法的java实现代码-Including bubble sort, merge sort, N Queen, such as the classic minimum spanning tree algorithm java code
ddvip_com_04065038a97af4
- 采用循环，而不是递规，系统资源占有少可计算 n 皇后问题把问题线性化处理，可以把问题分块，在分布式环境下用多台计算机一起算。-The use of the cycle, rather than delivery rules occupy less system resources computable n Queen of issues to deal with the problem of linear, you can block the problem, in distributed en
queen
- n皇后问题，能够快速的算出24个点，24个点过侯程序会变慢-the question of queen
nqueensquestion
- 可以对n皇后问题进行全面的实现，求出n皇后有多少种解法-N queens problem can be to achieve a comprehensive, calculate how many kinds of solution n Queen
Queen
- JAVA实现，动态规划算法解N皇后问题。
Queen
- 八皇后 进一步加深编程，进一步难度为N皇后问题-Eight Queens program to further deepen and further difficulty for the N queens problem
n-queen-problem-display
- n后问题演示程序，算法分析与设计，递归算法-N queen problem demonstration program, the algorithm analysis and design, recursion algorithm
n-queen
- 解决n皇后问题 利用回溯算法 n后问题等于在n×n格的棋盘上放置n个皇后，任何2个皇后不放在同一行或同一列或同一斜线上。即规定每一列放一个皇后，不会造成列上的冲突；当第i行被某个皇后占领后，则同一行上的所有空格都不能再放皇后，要把以i为下标的标记置为被占领状态。用回溯法解n后问题，用完全n叉树表示解空间。可行性约束Place剪去不满足行，列和斜线约束的子树。从根节点出发搜索解空间树。算法搜索至空间树的任何一结点时，先判断该点是否包含问题的解。如果肯定不包含，则跳过对以该结点为根的子树的搜索，
queen
- 算法设计与分析 java n后问题源码 王晓东书版本上的课堂练习的完整代码-Classroom exercises after the the problem source Wang Xiaodong book version of the complete code for the algorithm design and analysis of java n
Queen
- 算法分析与设计 用回溯法实现n皇后问题(java源码)-Algorithm Analysis and Design N-queens Problem Using Backtracking
n queen的管道风格，调用返回风格，黑板风格等实现
- n queen的管道风格，调用返回风格，黑板风格，管道风格实现
N-Queen
- N-Queen Problem Solution
Queen
- 采用拉斯维加斯算法和回溯法相结合，解决N皇后问题-Las Vegas using algorithms and backtracking Combination, N Queens problem solving
GA-nQueen
- Post codes, solve n queen with the help of genetic algorithms using MATLAB software.
Queen
- 用java语言，基于回溯法实现N皇后的位置放置方案，程序可以通过参数来设置要解决几个皇后的放置，默认是4个。(Using java language, backtracking method is used to implement the placement plan of N queens. The program can be set by parameters to solve the placement of several queens, and the default is 4.)